Fixed points and best approximation in Menger convex metric spaces

summary:We obtain necessary conditions for the existence of fixed point and approximate fixed point of nonexpansive and quasi nonexpansive maps defined on a compact convex subset of a uniformly convex complete metric space. We obtain results on best approximation as a fixed point in a strictly convex metric space

Group Decision Making Using Comparative Linguistic Expression Based on Hesitant Intuitionistic Fuzzy Sets

We introduce a method for aggregation of experts’ opinions given in the form of comparative linguistic expression. An algorithmic form of technique for order preference is proposed for group decision making. A simple example is given by using this method for the selection of the best alternative as well as ranking the alternatives from the best to the worst

Common fixed point for generalized set valued contractions satisfying an implicit relation in partially ordered metric spaces

Let $(X,d,preceq )$ be a partially ordered metric space. Let F, G be two set valued mappings on $X$. We obtained sufficient conditions for the existence of a common fixed point of F, G satisfying an implicit relation in X

Coincidence Point with Application to Stability of Iterative Procedure in Cone Metric Spaces

We obtain necessary conditions for the existence of coincidence point and common fixed point for contractive mappings in cone metric spaces. An application to the stability of J-iterative procedure for mappings having coincidence point in cone metric spaces is also given

EKELAND'S VARIATIONAL PRINCIPLE IN S^{JS}-METRIC SPACES

We prove Ekeland's variational principle in  S^{JS} - metric spaces. A generalization of Caristi fixed point theorem on S^{JS} - metric spaces is obtained as a consequenc

Common Fixed Points for Maps on Topological Vector Space Valued Cone Metric Spaces

We introduced a notion of topological vector space valued cone metric space and obtained some common fixed point results. Our results generalize some recent results in the literature

Induced hesitant 2-tuple linguistic aggregation operators with application in group decision making

In this article, hesitant 2-tuple linguistic arguments are used to evaluate the group decision making problems which have inter dependent or inter active attributes. Operational laws are developed for hesitant 2-tuple linguistic elements and based on these operational laws hesitant 2- tuple weighted averaging operator and generalized hesitant 2- tuple averaging operator are proposed. Combining Choquet integral with hesitant 2-tuple linguistic information, some new aggregation operators are defined, including the hesitant 2-tuple correlated averaging operator, the hesitant 2-tuple correlated geometric operator and the generalized hesitant 2-tuple correlated averaging operator. These proposed operators successfully manage the correlations among the elements. After investigating the properties of these operators, a multiple attribute decision making method based on these operators, is suggested. Finally, an example is given to illustrate the practicality and feasibility of proposed method

The contraction principle for set valued mappings on a metric space with a graph

Let (X, d) be a metric space and F : X hooked right arrow X be a set valued mapping. We obtain sufficient conditions for the existence of a fixed point of the mapping F in the metric space X endowed with a graph G such that the set V(G) of vertices of G coincides with X and the set of edges of G is E(G) = {(x, y) : (x, y) is an element of X x X}

The contraction principle for set valued mappings on a metric space with a graph

Let (X, d) be a metric space and F : X hooked right arrow X be a set valued mapping. We obtain sufficient conditions for the existence of a fixed point of the mapping F in the metric space X endowed with a graph G such that the set V(G) of vertices of G coincides with X and the set of edges of G is E(G) = {(x, y) : (x, y) is an element of X x X}

Role of honesty and confined interpersonal influence in modelling predilections

Classical models of decision-making do not incorporate for the role of influence and honesty that affects the process. This paper develops on the theory of influence in social network analysis. We study the role of influence and honesty of individual experts on collective outcomes. It is assumed that experts have the tendency to improve their initial predilection for an alternative, over the rest, if they interact with one another. It is suggested that this revised predilection may not be proposed with complete honesty by the expert. Degree of honesty is computed from the preference relation provided by the experts. This measure is dependent on average fuzziness in the relation and its disparity from an additive reciprocal relation. Moreover, an algorithm is introduced to cater for incompleteness in the adjacency matrix of interpersonal influences. This is done by analysing the information on how the expert has influenced others and how others have influenced the expert